Qualitative representation of spatial knowledge in two-dimensional space

Various relation-based systems, concerned with the qualitative representation and processing of spatial knowledge, have been developed in numerous application domains. In this article, we identify the common concepts underlying qualitative spatial knowledge representation, we compare the representational properties of the different systems, and we outline the computational tasks involved in relation-based spatial information processing. We also describesymbolic spatial indexes, relation-based structures that combine several ideas in spatial knowledge representation. A symbolic spatial index is an array that preserves only a set of spatial relations among distinct objects in an image, called the modeling space; the index array discards information, such as shape and size of objects, and irrelevant spatial relations. The construction of a symbolic spatial index from an input image can be thought of as a transformation that keeps only a set of representative points needed to define the relations of the modeling space. By keeping the relative arrangements of the representative points in symbolic spatial indexes and discarding all other points, we maintain enough information to answer queries regarding the spatial relations of the modeling space without the need to access the initial image or an object database. Symbolic spatial indexes can be used to solve problems involving route planning, composition of spatial relations, and update operations.     

Type inference in stack based languages

We consider a language of operations which pass parameters by means of a stack. An algebra over the set of type signatures is introduced, which allows the type signature of a program to be obtained from the type signatures of its constituent operations.Although the theories apply in principle to any stack based language, they have been evolved with particular regard to the proposed ANSI Standard Forth language, which is currently implemented in a type free manner. We hope this work will stimulate an interest in Forth amongst those applying algebraic techniques in software engineering, and we hope to lay the theoretical foundations for implementing practical type checkers to support Forth.     

Minimal forbidden subwords

Motivated by a study of similar problems stated for factors of words, we study forbidden subwords of a language or a word. A procedure for obtaining the set of all words avoiding a given set of subwords is presented. On the other hand, an algorithm for computing the set of minimal forbidden subwords for a word is given. The case of a two-letter alphabet appears to be particularly interesting and it is considered separately.     

Pattern expressions and pattern automata

We define the pattern expressions as an extension of both regular expressions and patterns. We prove several properties of the new family of languages, similar to those of extended regex languages [Câmpeanu et al., Int. J. Found. Comput. Sci. 14 (6) (2003) 1007-1018]. We also define an automata system that recognizes these languages. Differences between regex and pattern expressions are also discussed.     

On regular drawn symbolic picture languages

Drawn symbolic pictures are an extension of drawn pictures obtained by associating a symbol from an alphabet to each point of the picture. In the paper we will address some new interesting issues derived from the introduction of the symbols and we will identify the conditions, which ensure the preservation of properties holding for drawn pictures in the setting of the proposed extension.     

Metric-based reasoning about pseudocode design in the partial metrics system

The goal of the PMS project is to produce an environment in which the intelligent online assessment of the design for large-scale ADA programming projects is provided. The focus is on the representation of knowledge about the design process for an individual module. Changes in pseudocode complexity are measured in terms of partial metrics. These metrics can take the designers inferences about the pseudocode program structure into account when assessing module complexity. Next, a model of the stepwise refinement process is given which demonstrates how pseudocode elaboration decisions can be modelled in partial metric terms. Finally, the decisions associated with each refinement step for 17 example refinements taken from the computer science literature are described using partial metrics.     

Conceptual document modelling and retrieval

This paper presents the main current theoretical issues in Information Retrieval. The principles of conceptual modelling, as they have emerged in the database area, are presented and their application to document modelling in order to enhance document retrieval is discussed. Finally, the main features of the MULTOS project are presented and critically reviewed confronting them with the requirements which have been identified during the general discussion on document conceptual modelling for information retrieval.     

标志树文法及其语法分析

树文法是一种高维文法，能够用来表达二维以上复杂对象的构造规则．在模式识别、图式语言等领域有着广泛的应用前景．本文在树文法有关概念基础上提出了标志树、连接标志、标志树文法等概念，构造了标志树的匹配和识别算法，并成功解决了标志树文法的语法分析器构造问题．     

Granularity Analysis for Exploiting Adaptive Parallelism of Declarative Programs on Multiprocessors

1IntroductionAutomaticparallelexecutionofdeclarativelanguageprograms(e.g.functionprogramsandlogicprograms)isattractive,asitmakestheuseofparallelcomputersveryeasy,andtheprogrammerneednotbeconcernedwiththespecificsoftheunderlyingparallelarchitecture.However,ifseveralprocessorsareexecutingconcurrently,exploitingadaptiveparallelismishardduetonon-determinismoftaskgranularityanddatadependenciesamongtasks.TheearlysolutionproposedbyConeryandKibler[2]usesanorderingalgorithmtodeterminedependenciesatrun…     

Carla: A rule language for specifying communications architectures

Due to the unique requirements of a series of projects to specify communications architectures using graphical representations (Cara and MFD), we have developed the communications-oriented rule-based language Carla (Cara Rule Language), which provides an executable specification of the architecture being developed. Carla is designed to provide the ability to specify and simulate high-level, possibly incomplete, specifications of communications architectures, and to allow the developer to refine the specification through the addition of behavior-describing rules. Carla is also well-suited to creating black-box specifications of any system whose behavior depends on input/output history. We describe the features of the language, discuss various design issues, and provide examples of various communications protocols specified in Carla.